Source location in undirected and directed hypergraphs
نویسندگان
چکیده
منابع مشابه
Source location in undirected and directed hypergraphs
In this paper we generalize source location problems with edge-connectivity requirements on undirected and directed graphs to similar problems on undirected and directed hypergraphs. In the undirected case we consider an abstract framework which contains the source location for undirected hypergraphs as a special case and which can be solved in polynomial time. For the directed case, the asymme...
متن کاملEdge-connectivity of undirected and directed hypergraphs
The objective of the thesis is to discuss edge-connectivity and related connectivity conceptsin the context of undirected and directed hypergraphs. In particular, we focus on k-edge-connectivity and (k, l)-partition-connectivity of hypergraphs, and (k, l)-edge-connectivityof directed hypergraphs. A strong emphasis is placed on the role of submodularity in thestructural aspects o...
متن کاملDirected domination in oriented hypergraphs
ErdH{o}s [On Sch"utte problem, Math. Gaz. 47 (1963)] proved that every tournament on $n$ vertices has a directed dominating set of at most $log (n+1)$ vertices, where $log$ is the logarithm to base $2$. He also showed that there is a tournament on $n$ vertices with no directed domination set of cardinality less than $log n - 2 log log n + 1$. This notion of directed domination number has been g...
متن کاملReplicated partitioning for undirected hypergraphs
Hypergraph partitioning (HP) and replication are diverse but powerful tools that are traditionally applied separately to minimize the costs of parallel and sequential systems that access related data or process related tasks. When combined together, these two techniques have the potential of achieving significant improvements in performance of many applications. In this study, we provide an app...
متن کاملEulerian and Hamiltonian Directed Hypergraphs
Let H = (V ,E) be a directed hypergraph, also called a dihypergraph. Each vertex v ∈ V is incident to some hyperarcs in E . Conversely, each hyperarc E ∈ E is incident to some vertices in V . H is Eulerian if there is a dicycle C such that each hyperarc E ∈ E appears exactly once in C. Similarly, H is Hamiltonian if there is a dicycle C ′ such that every vertex v ∈ V appears exactly once in C ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2008
ISSN: 0167-6377
DOI: 10.1016/j.orl.2007.10.004